Computable invariance
نویسندگان
چکیده
منابع مشابه
Computable Invariance
In Computable Analysis each computable function is continuous and computably invariant , i.e. it maps computable points to computable points. On the other hand, discontinuity is a suucient condition for non-computability, but a discontinuous function might still be computably invariant. We investigate algebraic conditions which guarantee that a discon-tinuous function is suuciently discontinuou...
متن کاملComputable choice functions for computable linear orderings
One direction of research in computability theory is the study of the effective content of combinatorial theorems. The last chapter of Rosenstein’s book [2] reports on this type of investigation for linear orderings. Questions raised in that chapter have been the subject of a number of papers, and a summary of results in the area can be found in Downey [1]. In this paper, we consider the proble...
متن کاملLowness for Computable and Partial Computable Randomness
Ambos-Spies and Kucera [1, Problem 4.8] asked whether there is a non-computable set which is low for the computably random sets. We show that no such set exists. The same result holds for partial computable randomness. Each tally language that is low for polynomial randomness is on a polynomial time tree of bounded width. This research was done in 2003 but has not been published so far.
متن کاملComputable Categoricity versus Relative Computable Categoricity
We study the notion of computable categoricity of computable structures, comparing it especially to the notion of relative computable categoricity and its relativizations. We show that every 1-decidable computably categorical structure is relatively ∆2-categorical. We study the complexity of various index sets associated with computable categoricity and relative computable categoricity. We also...
متن کاملComputable functional analysis: compact operators on computable banach spaces and computable best approximation
The present thesis deals with computable functional analysis and in this context, especially, with compact operators on computable Banach spaces. For this purpose, the representation based approach to computable analysis (TTE) is used. In the first part, computable Banach spaces with computable Schauder bases are introduced and two representations each are defined for the dual space of a comput...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1999
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(98)00095-4